Inventory Based Bi-Objective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm

Job shop scheduling problem is a typical NP-hard problem. An inventory based two-objective job shop scheduling model was proposed in this paper, in which both the make-span (the total completion time) and the inventory capacity were as objectives and were optimized simultaneously. To solve the proposed model more effectively, some tailor made genetic operators were designed by making full use o...

متن کامل

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

This paper presents new, carefully designed algorithms for five biobjective permutation flow shop scheduling problems that arise from the pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) both, the weighted and nonweighted total tardiness of all jobs. The proposed algorithm combines two search methods, two-phase local search and Pa...

متن کامل

Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs

This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with reentrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are requi...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2013

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2013/976065